Algorithms for Minimum m -Connected k -Dominating Set Problem
نویسندگان
چکیده
In wireless sensor networks, virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem and perform some other tasks such as area monitoring. Previous work in this area has mainly focused on how to set up a small virtual backbone for high efficiency, which is modelled as the minimum Connected Dominating Set (CDS) problem. In this paper we consider how to establish a small virtual backbone to balance efficiency and fault tolerance. This problem can be formalized as the minimum m-connected k-dominating set problem, which is a general version of minimum CDS problem with m = 1 and k = 1. In this paper we will propose some approximation algorithms for this problem that beat the current best performance ratios.
منابع مشابه
Algorithms for minimum m-connected k-tuple dominating set problem
In wireless sensor networks, a virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem and perform some other tasks such as area monitoring. Previous work in this area has mainly focused on how to set up a small virtual backbone for high efficiency, which is modelled as the minimum Connected Dominating Set (CDS) problem. In this paper we cons...
متن کاملPerformance Guaranteed Approximation Algorithm for Minimum $k$-Connected $m$-Fold Dominating Set
To achieve an efficient routing in a wireless sensor network, connected dominating set (CDS) is used as virtual backbone. A fault-tolerant virtual backbone can be modeled as a (k,m)-CDS. For a connected graph G = (V,E) and two fixed integers k and m, a node set C ⊆ V is a (k,m)-CDS of G if every node in V \C has at least m neighbors in C, and the subgraph of G induced by C is k-connected. Previ...
متن کاملConstant-approximation algorithms for highly connected multi-dominating sets in unit disk graphs
Given an undirected graph on a node set V and positive integers k and m, a k-connected m-dominating set ((k,m)-CDS) is defined as a subset S of V such that each node in V \ S has at least m neighbors in S, and a k-connected subgraph is induced by S. The weighted (k,m)-CDS problem is to find a minimum weight (k,m)-CDS in a given node-weighted graph. The problem is called the unweighted (k,m)-CDS...
متن کاملOn Approximating Minimum 3-connected m-dominating Set Problem in Unit Disk Graph
Over years, virtual backbone has attracted lots of attentions as a promising approach to deal with the broadcasting storm problem in wireless networks. Frequently, the problem of a quality virtual backbone is formulated as a variation of the minimum connected dominating set problem. However, a virtual backbone computed in this way is not resilient against topology change since the induced graph...
متن کاملOn minimum m -connected k -dominating set problem in unit disc graphs
Minimum m-connected k-dominating set problem is as follows: Given a graph G= (V ,E) and two natural numbers m and k, find a subset S ⊆ V of minimal size such that every vertex in V \ S is adjacent to at least k vertices in S and the induced graph of S is m-connected. In this paper we study this problem with unit disc graphs and small m, which is motivated by the design of fault-tolerant virtual...
متن کامل